Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields

نویسندگان

چکیده

Inference-based optimization via simulation, which substitutes Gaussian process (GP) learning for the structural properties exploited in mathematical programming, is a powerful paradigm that has been shown to be remarkably effective problems of modest feasible-region size and decision-variable dimension. The limitation “modest” result computational overhead numerical challenges encountered computing GP conditional (posterior) distribution on each iteration. In this paper, we substantially expand discrete-decision-variable optimization-via-simulation can attacked way by exploiting particular GP—discrete Markov random fields—and carefully tailored methods. rapid Improvement Algorithm (rGMIA), an algorithm delivers both global convergence guarantee finite-sample optimality-gap inference significantly larger problems. Between infrequent evaluations distribution, rGMIA applies full power rapidly search smaller sets promising feasible solutions need not spatially close. We document savings complexity analysis extensive empirical study. Summary Contribution: broad topic paper means optimizing some performance measure system may only estimated executing stochastic, discrete-event simulation. Stochastic simulation core method operations research. focus speeding-up computations underlying existing based learning, where discrete Random Field. This speed-up accomplished employing smart linear algebra, state-of-the-art algorithms, careful divide-and-conquer evaluation strategy. Problems greater than any other with similar guarantees solve are solved as illustrations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of Discrete Markov Random Fields via Dual Decomposition

A new message-passing scheme for MRF optimization is proposed in this paper. This scheme inherits better theoretical properties than all other state-of-the-art message passing methods and in practice performs equally well/outperforms them. It is based on the very powerful technique of Dual Decomposition [1] and leads to an elegant and general framework for understanding/designing message-passin...

متن کامل

Approximating Hidden Gaussian Markov Random Fields

This paper discusses how to construct approximations to a unimodal hidden Gaussian Markov random field on a graph of dimensionnwhen the likelihood consists of mutually independent data. We demonstrate that a class of non-Gaussian approximations can be constructed for a wide range of likelihood models. They have the appealing properties that exact samples can be drawn from them, the normalisatio...

متن کامل

Subset Selection for Gaussian Markov Random Fields

Given a Gaussian Markov random field, we consider the problem of selecting a subset of variables to observe which minimizes the total expected squared prediction error of the unobserved variables. We first show that finding an exact solution is NP-hard even for a restricted class of Gaussian Markov random fields, called Gaussian free fields, which arise in semi-supervised learning and computer ...

متن کامل

Numerical Simulation of Non-Gaussian Random Fields

The non-Gaussian random fields are used to modelling some dynamic loads generated by wind turbulence, ocean waves, earthquake ground motion etc. These fields also represent the uncertain properties of different materials (reinforced concrete, composite, soils etc.). This paper presents some methods and the corresponding algorithms to the numerical simulation of stationary non-Gaussian random fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informs Journal on Computing

سال: 2021

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2020.0971